244A - Dividing Orange - CodeForces Solution

implementation *900

Please click on ads to support us..

Python Code: 

I=lambda:list(map(int,input().split()))
n,k=I()
a=I()
s=list(range(1,n*k+1))
for i in a:s.remove(i)
for i in range(k):print(' '.join(map(str,[a[i]]+s[i::k])))

C++ Code: 

#include <bits/stdc++.h>

using namespace std;

long long n,m,a[1069][1069];
bitset<1000069> vtd;

int main()
{
  long long i,j,k,p;
  
  scanf("%lld%lld",&n,&m);
  for(i=1;i<=m;i++)
  {
    scanf("%lld",&k);
    a[i][1]=k;
    vtd[k]=1;
  }
  p=1;
  for(i=1;i<=m;i++)
  {
    for(j=2;j<=n;j++)
    {
      for(;vtd[p];p++);
      a[i][j]=p;
      vtd[p]=1;
    }
    for(j=1;j<=n;j++)
    {
      printf("%lld%c",a[i][j]," \n"[j==n]);
    }
  }
}


Comments

Submit
0 Comments
More Questions

1716A - 2-3 Moves
1670B - Dorms War
1716B - Permutation Chain
987A - Infinity Gauntlet
1676G - White-Black Balanced Subtrees
1716D - Chip Move
1352F - Binary String Reconstruction
1487B - Cat Cycle
1679C - Rooks Defenders
56A - Bar
1694B - Paranoid String
35A - Shell Game
1684A - Digit Minimization
43B - Letter
1017A - The Rank
1698B - Rising Sand
235A - LCM Challenge
1075B - Taxi drivers and Lyft
1562A - The Miracle and the Sleeper
1216A - Prefixes
1490C - Sum of Cubes
868A - Bark to Unlock
873B - Balanced Substring
1401D - Maximum Distributed Tree
1716C - Robot in a Hallway
1688B - Patchouli's Magical Talisman
99A - Help Far Away Kingdom
622B - The Time
1688C - Manipulating History
1169D - Good Triple